#include <iostream>

using namespace std;

int arr[1000] = {0};

void qsort(int l,int r){
    int mid = arr[(l+r)/2];
    int i = l,j = r;

    while(i <= j){
        while (arr[i] < mid) i++;
        while (arr[j] > mid) j--;

        if(j >= i){
            int p = arr[j];
            arr[j] = arr[i];
            arr[i] = p;
            i ++;j--;
        }

    }
    if (l < j) qsort(l,j);
    if (i < r) qsort(i,r);

}

int main(){
    int n,i;

    cin >> n;

    for(i = 0;i< n;i++){
        cin >> arr[i];
    }

    qsort(0,n-1);

    int a = arr[n/2];
    int k = 0;
    for (int i = 0;i < n;i++){
        if (arr[i] == a){
            k ++;

        }
    }

    if (k > n/2){
        cout << a;
    }else{
        cout << "no" << endl;
    }

}